| contributor | Institut für Architektur von Anwendungssystemen (IAAS) |
| creator | Kopp, Oliver |
| Khalaf, Rania | |
| Leymann, Frank | |
| date | 2008-07 |
| description | WS-BPEL is a standard language to model business processes. Control flow is modeled explicitly using links. Data is passed via shared variables and there is no notion of explicit data links. However, explicit data links are an important means to reason about business process models. We present an algorithm to derive explicit data links in WS-BPEL processes. By considering dead path elimination as defined in WS-BPEL, we reduce the number of derived data links when compared to existing approaches that ignore dead path elimination. |
| identifier | http://www.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2008-27&engl=1 |
| ISBN: DOI:10.1109/SCC.2008.122 | |
| ISBN: ISBN:978-0-7695-3283-7 | |
| language | eng |
| publisher | Honolulu, Hawaii, USA: IEEE Computer Society Press |
| source | In: Proceedings of the International Conference on Services Computing, SCC 2008, pp. 367-376 |
| subject | Programming Languages (CR D.3) |
| Semantics of Programming Languages (CR F.3.2) | |
| Data-flow Analysis | |
| Reaching Definitions Analysis | |
| def-use edges | |
| data link | |
| BPEL | |
| title | Deriving Explicit Data Links in WS-BPEL Processes |
| type | Text |
| Article in Proceedings |